Fractal Image Coding as Projections Onto Convex Sets
نویسندگان
چکیده
We show how fractal image coding can be viewed and generalized in terms of the method of projections onto convex sets (POCS). In this approach, the fractal code defines a set of spatial domain similarity constraints. We also show how such a reformulation in terms of POCS allows additional contraints to be imposed during fractal image decoding. Two applications are presented: image construction with an incomplete fractal code and image denoising.
منابع مشابه
Concealment of damaged block transform coded images using projections onto convex sets
An algorithm for lost signal restoration in block-based still image and video sequence coding is presented. Problems arising from imperfect transmission of block-coded images result in lost blocks. The resulting image is flawed by the absence of square pixel regions that are notably perceived by human vision, even in real-time video sequences. Error concealment is aimed at masking the effect of...
متن کاملConvex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
Solving a convex set theoretic image recovery problem amounts to finding a point in the intersection of closed and convex sets in a Hilbert space. The projection onto convex sets (POCS) algorithm, in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several...
متن کاملRemoval of compression artifacts using projections onto convex sets and line process modeling
We present a new image recovery algorithm to remove, in addition to blocking, ringing artifacts from compressed images and video. This new algorithm is based on the theory of projections onto convex sets (POCS). A new family of directional smoothness constraint sets is defined based on line processes modeling of the image edge structure. The definition of these smoothness sets also takes into a...
متن کاملCombettes : Convex Set Theoretic Image Recovery by Extrapolated Subgradient Projections 3
| Solving a convex set theoretic image recovery problem amounts to nding a point in the intersection of closed and convex sets in a Hilbert space. The POCS algorithm , in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several shortcomings: it converges s...
متن کاملProjection-based spatially adaptive reconstruction of block-transform compressed images
At the present time, block-transform coding is probably the most popular approach for image compression. For this approach, the compressed images are decoded using only the transmitted transform data. We formulate image decoding as an image recovery problem. According to this approach, the decoded image is reconstructed using not only the transmitted data but, in addition, the prior knowledge t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006